Positive semidefinite univariate matrix polynomials
نویسندگان
چکیده
منابع مشابه
Symmetric, Positive Semidefinite Polynomials Which
This paper presents a construction for symmetric, non-negative polynomials, which are not sums of squares. It explicitly generalizes the Motzkin polynomial and the Robinson polynomials to families of non-negative polynomials, which are not sums of squares. The degrees of the resulting polynomials can be chosen in advance. 2000 Mathematics Subject Classification: 12Y05, 20C30, 12D10, 26C10, 12E10
متن کاملThe complexity of positive semidefinite matrix factorization
Let A be a matrix with nonnegative real entries. The PSD rank of A is the smallest integer k for which there exist k × k real PSD matrices B1, . . . , Bm, C1, . . . , Cn satisfying A(i|j) = tr(BiCj) for all i, j. This paper determines the computational complexity status of the PSD rank. Namely, we show that the problem of computing this function is polynomial-time equivalent to the existential ...
متن کاملDeterministic Symmetric Positive Semidefinite Matrix Completion
We consider the problem of recovering a symmetric, positive semidefinite (SPSD) matrix from a subset of its entries, possibly corrupted by noise. In contrast to previous matrix recovery work, we drop the assumption of a random sampling of entries in favor of a deterministic sampling of principal submatrices of the matrix. We develop a set of sufficient conditions for the recovery of a SPSD matr...
متن کاملMatrix Representations for Positive Noncommutative Polynomials
In real semialgebraic geometry it is common to represent a polynomial q which is positive on a region R as a weighted sum of squares. Serious obstructions arise when q is not strictly positive on the region R. Here we are concerned with noncommutative polynomials and obtaining a representation for them which is valid even when strict positivity fails. Specifically, we treat a ”symmetric” polyno...
متن کاملZero sets of univariate polynomials
Let L be the zero set of a nonconstant monic polynomial with complex coe¢ cients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion of distance from a point to a subset, more general than the usual one, that allows us to measure distances to subsets like L. To verify the correctness of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematische Zeitschrift
سال: 2018
ISSN: 0025-5874,1432-1823
DOI: 10.1007/s00209-018-2137-7